Evolving non-dominated solutions in multiobjective service restoration for automated distribution networks

نویسندگان

  • Antonino Augugliaro
  • Luigi Dusonchet
  • Eleonora Riva Sanseverino
چکیده

The problem here dealt with is that of Service Restoration (SR) in automated distribution networks. In such networks, configuration and compensation level as well as loads insertion status can be remotely controlled. The considered SR problem should be handled using Multiobjective Optimization, MO, techniques since its solution requires a compromise between different criteria. In the adopted formulation, these criteria are the supply of the highest number of loads and the minimum power losses. The Authors propose a new MO approach, the Non-dominated Sorting Fuzzy Evolution Strategy, NS–FES, which uses part of the Non-dominated Sorting Genetic Algorithm, NSGA, proposed by K. Deb. The ability of NSGA to divide a population of solutions in classes of dominance allows a fruitful application of another efficient MO strategy already proposed and tested by the Authors (FES, Fuzzy Evolution Strategy). In this way, diversity and high quality of solutions is possible. After a brief description of the SR problem and a review of the approaches recently proposed in literature, the NS–FES solution strategy is presented in detail. Finally, test results using the three approaches (NSGA, FES, NS–FES) are carried out and compared. © 2001 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective Reconfiguration for Loss Reduction and Service Restoration Using Simulated Annealing

This paper presents an approach to the reconfiguration of radial distribution networks, for both loss reduction and service restoration, using the same metaheuristic tool: the simulated annealing algorithm. Besides the main objective of each problem (minimizing losses or load not supplied) minimization of the total number of switching device operations is also included as a possible criterion. ...

متن کامل

Multiobjective Optimization Solution for Shortest Path Routing Problem

The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...

متن کامل

A Nondominated Sorting Genetic Algorithm for Shortest Path Routing Problem

The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...

متن کامل

Multiobjective Optimization of Distribution Networks Using Genetic Algorithms

This paper presents the application of multiobjective optimization, for finding out the optimal power distribution network. A multiobjective optimization model simultaneously minimizing the system expansion costs while achieving the best reliability (optimal sizing and location of future feeders and substations). Furthermore, the problem has some constraints. The proposed methodology has been t...

متن کامل

Characterization of efficient points of the production possibility set under variable returns to scale in DEA

  We suggest a method for finding the non-dominated points of the production possibility set (PPS) with variable returns to scale (VRS) technology in data envelopment analysis (DEA). We present a multiobjective linear programming (MOLP) problem whose feasible region is the same as the PPS under variable returns to scale for generating non-dominated points. We demonstrate that Pareto solutions o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001